0.06/0.24 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.24 % Command : run_E %s %d THM 0.10/0.48 % Computer : n023.cluster.edu 0.10/0.48 % Model : x86_64 x86_64 0.10/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.48 % Memory : 8042.1875MB 0.10/0.48 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.48 % CPULimit : 1440 0.10/0.48 % WCLimit : 180 0.10/0.48 % DateTime : Thu Jul 4 09:58:24 EDT 2024 0.10/0.50 % CPUTime : 0.18/0.93 Running higher-order theorem proving 0.18/0.94 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.ry2LADc4YR/E---3.1_18036.p 3.83/2.00 # Version: 3.2.0-ho 3.83/2.00 # Preprocessing class: HSLSSMSMSSSNSFA. 3.83/2.00 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 3.83/2.00 # Starting new_ho_10 with 540s (3) cores 3.83/2.00 # Starting sh2lt with 180s (1) cores 3.83/2.00 # Starting new_ho_5 with 180s (1) cores 3.83/2.00 # Starting full_lambda_5 with 180s (1) cores 3.83/2.00 # Starting sh9 with 180s (1) cores 3.83/2.00 # Starting ehoh_best8_lambda with 180s (1) cores 3.83/2.00 # sh2lt with pid 18115 completed with status 0 3.83/2.00 # Result found by sh2lt 3.83/2.00 # Preprocessing class: HSLSSMSMSSSNSFA. 3.83/2.00 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 3.83/2.00 # Starting new_ho_10 with 540s (3) cores 3.83/2.00 # Starting sh2lt with 180s (1) cores 3.83/2.00 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 3.83/2.00 # Search class: HGHSM-FFMS33-MSFFFFNN 3.83/2.00 # partial match(3): FGHSM-FFMS31-MFFFFFNN 3.83/2.00 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 3.83/2.00 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 78s (1) cores 3.83/2.00 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 18124 completed with status 0 3.83/2.00 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y 3.83/2.00 # Preprocessing class: HSLSSMSMSSSNSFA. 3.83/2.00 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 3.83/2.00 # Starting new_ho_10 with 540s (3) cores 3.83/2.00 # Starting sh2lt with 180s (1) cores 3.83/2.00 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 3.83/2.00 # Search class: HGHSM-FFMS33-MSFFFFNN 3.83/2.00 # partial match(3): FGHSM-FFMS31-MFFFFFNN 3.83/2.00 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 3.83/2.00 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 78s (1) cores 3.83/2.00 # Preprocessing time : 0.003 s 3.83/2.00 3.83/2.00 # Proof found! 3.83/2.00 # SZS status Theorem 3.83/2.00 # SZS output start CNFRefutation 3.83/2.00 thf(decl_sort1, type, del: $tType). 3.83/2.00 thf(decl_22, type, bool: del). 3.83/2.00 thf(decl_24, type, arr: del > del > del). 3.83/2.00 thf(decl_25, type, mem: $i > del > $o). 3.83/2.00 thf(decl_26, type, ap: $i > $i > $i). 3.83/2.00 thf(decl_28, type, p: $i > $o). 3.83/2.00 thf(decl_31, type, c_2EquantHeuristics_2EGUESS__FORALL__GAP: del > del > $i). 3.83/2.00 thf(decl_32, type, c_2EquantHeuristics_2EGUESS__EXISTS__GAP: del > del > $i). 3.83/2.00 thf(decl_33, type, c_2EquantHeuristics_2EGUESS__FORALL__POINT: del > del > $i). 3.83/2.00 thf(decl_34, type, c_2EquantHeuristics_2EGUESS__EXISTS__POINT: del > del > $i). 3.83/2.00 thf(decl_35, type, c_2EquantHeuristics_2EGUESS__FORALL: del > del > $i). 3.83/2.00 thf(decl_37, type, c_2EquantHeuristics_2EGUESS__EXISTS: del > del > $i). 3.83/2.00 thf(decl_48, type, epred4_4: $i > $i > del > del > $o). 3.83/2.00 thf(decl_49, type, esk1_0: del). 3.83/2.00 thf(decl_50, type, esk2_0: del). 3.83/2.00 thf(decl_51, type, esk3_0: $i). 3.83/2.00 thf(decl_52, type, esk4_0: $i). 3.83/2.00 thf(decl_53, type, esk5_0: $i). 3.83/2.00 thf(decl_55, type, esk7_4: del > del > $i > $i > $i). 3.83/2.00 thf(decl_56, type, esk8_5: del > del > $i > $i > $i > $i). 3.83/2.00 thf(decl_57, type, esk9_6: del > del > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_58, type, esk10_7: del > del > $i > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_59, type, esk11_7: del > del > $i > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_60, type, esk12_6: del > del > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_61, type, esk13_6: del > del > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_62, type, esk14_6: del > del > $i > $i > $i > $i > $i). 3.83/2.00 thf(decl_63, type, esk15_5: del > del > $i > $i > $i > $i). 3.83/2.00 thf(decl_64, type, esk16_4: del > del > $i > $i > $i). 3.83/2.00 thf(decl_65, type, epred5_0: $o). 3.83/2.00 thf(decl_66, type, epred6_0: $o). 3.83/2.00 thf(conj_thm_2EquantHeuristics_2EGUESS__REWRITES, axiom, ![X13:del, X14:del, X19:$i]:(((mem @ X19 @ (arr @ X13 @ X14))=>![X20:$i]:((((((((![X21:$i]:(((?[X22:$i]:(((p @ (ap @ X20 @ (ap @ X19 @ X22)))&(mem @ X22 @ X13)))<=(p @ (ap @ X20 @ X21)))<=(mem @ X21 @ X14)))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X13 @ X14) @ X19) @ X20)))&![X23:$i]:((![X24:$i]:(((![X25:$i]:((((p @ (ap @ X24 @ X25))=>?[X26:$i]:(((mem @ X26 @ X13)&((X25)=(ap @ X23 @ X26)))))<=(mem @ X25 @ X14)))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X13 @ X14) @ X23) @ X24)))<=(mem @ X24 @ (arr @ X14 @ bool))))<=(mem @ X23 @ (arr @ X13 @ X14)))))&![X27:$i]:(((mem @ X27 @ (arr @ X13 @ X14))=>![X28:$i]:((((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X13 @ X14) @ X27) @ X28))<=>![X29:$i]:(((mem @ X29 @ X14)=>(~((p @ (ap @ X28 @ X29)))=>?[X30:$i]:(((mem @ X30 @ X13)&((X29)=(ap @ X27 @ X30))))))))<=(mem @ X28 @ (arr @ X14 @ bool)))))))&![X31:$i]:(((mem @ X31 @ (arr @ X13 @ X14))=>![X32:$i]:(((mem @ X32 @ (arr @ X14 @ bool))=>(![X33:$i]:(((mem @ X33 @ X13)=>~((p @ (ap @ X32 @ (ap @ X31 @ X33))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X14) @ X31) @ X32))))))))&![X34:$i]:((![X35:$i]:(((mem @ X35 @ (arr @ X14 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X13 @ X14) @ X34) @ X35))<=>![X36:$i]:(((mem @ X36 @ X13)=>(p @ (ap @ X35 @ (ap @ X34 @ X36))))))))<=(mem @ X34 @ (arr @ X13 @ X14)))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X13 @ X14) @ X19) @ X20))<=>![X37:$i]:(((mem @ X37 @ X14)=>(~((p @ (ap @ X20 @ X37)))=>?[X38:$i]:(((mem @ X38 @ X13)&~((p @ (ap @ X20 @ (ap @ X19 @ X38)))))))))))<=(mem @ X20 @ (arr @ X14 @ bool)))))), file('/export/starexec/sandbox2/tmp/tmp.ry2LADc4YR/E---3.1_18036.p', conj_thm_2EquantHeuristics_2EGUESS__REWRITES)). 3.83/2.00 thf(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT, conjecture, ![X13:del, X14:del, X19:$i]:(((mem @ X19 @ (arr @ X14 @ X13))=>![X20:$i]:(((mem @ X20 @ (arr @ X13 @ bool))=>![X46:$i]:(((mem @ X46 @ (arr @ X13 @ bool))=>(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X14 @ X13) @ X19) @ X20))=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X14 @ X13) @ X19) @ X46)))<=![X47:$i]:(((mem @ X47 @ X13)=>((p @ (ap @ X46 @ X47))=>(p @ (ap @ X20 @ X47)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.ry2LADc4YR/E---3.1_18036.p', conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT)). 3.83/2.00 thf(ap_tp, axiom, ![X1:del, X2:del, X3:$i]:((![X4:$i]:(((mem @ (ap @ X3 @ X4) @ X2)<=(mem @ X4 @ X1)))<=(mem @ X3 @ (arr @ X1 @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.ry2LADc4YR/E---3.1_18036.p', ap_tp)). 3.83/2.00 thf(c_0_3, plain, ![X13:del, X14:del, X20:$i, X19:$i]:(((epred4_4 @ X19 @ X20 @ X13 @ X14)<=>((((((![X21:$i]:(((mem @ X21 @ X14)=>((p @ (ap @ X20 @ X21))=>?[X22:$i]:(((p @ (ap @ X20 @ (ap @ X19 @ X22)))&(mem @ X22 @ X13))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X13 @ X14) @ X19) @ X20)))&![X23:$i]:(((mem @ X23 @ (arr @ X13 @ X14))=>![X24:$i]:(((mem @ X24 @ (arr @ X14 @ bool))=>(![X25:$i]:(((mem @ X25 @ X14)=>((p @ (ap @ X24 @ X25))=>?[X26:$i]:(((mem @ X26 @ X13)&((X25)=(ap @ X23 @ X26)))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X13 @ X14) @ X23) @ X24))))))))&![X27:$i]:(((mem @ X27 @ (arr @ X13 @ X14))=>![X28:$i]:(((mem @ X28 @ (arr @ X14 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X13 @ X14) @ X27) @ X28))<=>![X29:$i]:(((mem @ X29 @ X14)=>(~(p @ (ap @ X28 @ X29))=>?[X30:$i]:(((mem @ X30 @ X13)&((X29)=(ap @ X27 @ X30)))))))))))))&![X31:$i]:(((mem @ X31 @ (arr @ X13 @ X14))=>![X32:$i]:(((mem @ X32 @ (arr @ X14 @ bool))=>(![X33:$i]:(((mem @ X33 @ X13)=>~(p @ (ap @ X32 @ (ap @ X31 @ X33)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X14) @ X31) @ X32))))))))&![X34:$i]:(((mem @ X34 @ (arr @ X13 @ X14))=>![X35:$i]:(((mem @ X35 @ (arr @ X14 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X13 @ X14) @ X34) @ X35))<=>![X36:$i]:(((mem @ X36 @ X13)=>(p @ (ap @ X35 @ (ap @ X34 @ X36)))))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X13 @ X14) @ X19) @ X20))<=>![X37:$i]:(((mem @ X37 @ X14)=>(~(p @ (ap @ X20 @ X37))=>?[X38:$i]:(((mem @ X38 @ X13)&~(p @ (ap @ X20 @ (ap @ X19 @ X38)))))))))))), introduced(definition)). 3.83/2.00 thf(c_0_4, plain, ![X13:del, X14:del, X19:$i]:(((mem @ X19 @ (arr @ X13 @ X14))=>![X20:$i]:(((mem @ X20 @ (arr @ X14 @ bool))=>(epred4_4 @ X19 @ X20 @ X13 @ X14))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[conj_thm_2EquantHeuristics_2EGUESS__REWRITES]), c_0_3])). 3.83/2.00 thf(c_0_5, plain, (~((epred6_0))<=>![X4:$i, X9:$i]:(~((epred4_4 @ X4 @ X9 @ esk2_0 @ esk1_0)))), introduced(definition)). 3.83/2.00 thf(c_0_6, plain, ![X183:del, X184:del, X185:$i, X186:$i]:((~(mem @ X185 @ (arr @ X183 @ X184))|(~(mem @ X186 @ (arr @ X184 @ bool))|(epred4_4 @ X185 @ X186 @ X183 @ X184)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 3.83/2.00 thf(c_0_7, negated_conjecture, ~(![X13:del, X14:del, X19:$i]:(((mem @ X19 @ (arr @ X14 @ X13))=>![X20:$i]:(((mem @ X20 @ (arr @ X13 @ bool))=>![X46:$i]:(((mem @ X46 @ (arr @ X13 @ bool))=>(![X47:$i]:(((mem @ X47 @ X13)=>((p @ (ap @ X46 @ X47))=>(p @ (ap @ X20 @ X47)))))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X14 @ X13) @ X19) @ X20))=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X14 @ X13) @ X19) @ X46))))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT])])). 3.83/2.00 thf(c_0_8, plain, ![X13:del, X14:del, X20:$i, X19:$i]:(((epred4_4 @ X19 @ X20 @ X13 @ X14)=>((((((![X21:$i]:(((mem @ X21 @ X14)=>((p @ (ap @ X20 @ X21))=>?[X22:$i]:(((p @ (ap @ X20 @ (ap @ X19 @ X22)))&(mem @ X22 @ X13))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X13 @ X14) @ X19) @ X20)))&![X23:$i]:(((mem @ X23 @ (arr @ X13 @ X14))=>![X24:$i]:(((mem @ X24 @ (arr @ X14 @ bool))=>(![X25:$i]:(((mem @ X25 @ X14)=>((p @ (ap @ X24 @ X25))=>?[X26:$i]:(((mem @ X26 @ X13)&((X25)=(ap @ X23 @ X26)))))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X13 @ X14) @ X23) @ X24))))))))&![X27:$i]:(((mem @ X27 @ (arr @ X13 @ X14))=>![X28:$i]:(((mem @ X28 @ (arr @ X14 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X13 @ X14) @ X27) @ X28))<=>![X29:$i]:(((mem @ X29 @ X14)=>(~(p @ (ap @ X28 @ X29))=>?[X30:$i]:(((mem @ X30 @ X13)&((X29)=(ap @ X27 @ X30)))))))))))))&![X31:$i]:(((mem @ X31 @ (arr @ X13 @ X14))=>![X32:$i]:(((mem @ X32 @ (arr @ X14 @ bool))=>(![X33:$i]:(((mem @ X33 @ X13)=>~(p @ (ap @ X32 @ (ap @ X31 @ X33)))))<=>(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X13 @ X14) @ X31) @ X32))))))))&![X34:$i]:(((mem @ X34 @ (arr @ X13 @ X14))=>![X35:$i]:(((mem @ X35 @ (arr @ X14 @ bool))=>((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X13 @ X14) @ X34) @ X35))<=>![X36:$i]:(((mem @ X36 @ X13)=>(p @ (ap @ X35 @ (ap @ X34 @ X36)))))))))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X13 @ X14) @ X19) @ X20))<=>![X37:$i]:(((mem @ X37 @ X14)=>(~(p @ (ap @ X20 @ X37))=>?[X38:$i]:(((mem @ X38 @ X13)&~(p @ (ap @ X20 @ (ap @ X19 @ X38)))))))))))), inference(split_equiv,[status(thm)],[c_0_3])). 3.83/2.00 thf(c_0_9, negated_conjecture, ![X3:$i, X4:$i]:(((epred6_0)|~((epred4_4 @ X3 @ X4 @ esk2_0 @ esk1_0)))), inference(split_equiv,[status(thm)],[c_0_5])). 3.83/2.00 thf(c_0_10, plain, ![X1:del, X4:$i, X3:$i, X2:del]:(((epred4_4 @ X3 @ X4 @ X1 @ X2)|~((mem @ X3 @ (arr @ X1 @ X2)))|~((mem @ X4 @ (arr @ X2 @ bool))))), inference(split_conjunct,[status(thm)],[c_0_6])). 3.83/2.00 thf(c_0_11, negated_conjecture, ![X140:$i]:(((mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0))&((mem @ esk4_0 @ (arr @ esk1_0 @ bool))&((mem @ esk5_0 @ (arr @ esk1_0 @ bool))&((~(mem @ X140 @ esk1_0)|(~(p @ (ap @ esk5_0 @ X140))|(p @ (ap @ esk4_0 @ X140))))&((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0))&~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])). 3.83/2.00 thf(c_0_12, plain, ![X208:del, X209:del, X210:$i, X211:$i, X213:$i, X214:$i, X216:$i, X217:$i, X219:$i, X220:$i, X222:$i, X223:$i, X224:$i, X227:$i, X228:$i, X229:$i, X231:$i, X232:$i, X233:$i, X234:$i, X236:$i, X239:$i]:((((((((((mem @ (esk7_4 @ X208 @ X209 @ X210 @ X211) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((p @ (ap @ X210 @ (esk7_4 @ X208 @ X209 @ X210 @ X211)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X210 @ (ap @ X211 @ X213)))|~(mem @ X213 @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&(((p @ (ap @ X210 @ (ap @ X211 @ (esk8_5 @ X208 @ X209 @ X210 @ X211 @ X214))))|~(p @ (ap @ X210 @ X214))|~(mem @ X214 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((mem @ (esk8_5 @ X208 @ X209 @ X210 @ X211 @ X214) @ X208)|~(p @ (ap @ X210 @ X214))|~(mem @ X214 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((((mem @ (esk9_6 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((p @ (ap @ X217 @ (esk9_6 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(mem @ X219 @ X208)|((esk9_6 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217)!=(ap @ X216 @ X219))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&(((mem @ (esk10_7 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217 @ X220) @ X208)|~(p @ (ap @ X217 @ X220))|~(mem @ X220 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((X220)=(ap @ X216 @ (esk10_7 @ X208 @ X209 @ X210 @ X211 @ X216 @ X217 @ X220)))|~(p @ (ap @ X217 @ X220))|~(mem @ X220 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__GAP @ X208 @ X209) @ X216) @ X217))|~(mem @ X217 @ (arr @ X209 @ bool))|~(mem @ X216 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))))&((((mem @ (esk11_7 @ X208 @ X209 @ X210 @ X211 @ X222 @ X223 @ X224) @ X208)|(p @ (ap @ X223 @ X224))|~(mem @ X224 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X222) @ X223))|~(mem @ X223 @ (arr @ X209 @ bool))|~(mem @ X222 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((X224)=(ap @ X222 @ (esk11_7 @ X208 @ X209 @ X210 @ X211 @ X222 @ X223 @ X224)))|(p @ (ap @ X223 @ X224))|~(mem @ X224 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X222) @ X223))|~(mem @ X223 @ (arr @ X209 @ bool))|~(mem @ X222 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(((mem @ (esk12_6 @ X208 @ X209 @ X210 @ X211 @ X222 @ X223) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X222) @ X223))|~(mem @ X223 @ (arr @ X209 @ bool))|~(mem @ X222 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((~(p @ (ap @ X223 @ (esk12_6 @ X208 @ X209 @ X210 @ X211 @ X222 @ X223)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X222) @ X223))|~(mem @ X223 @ (arr @ X209 @ bool))|~(mem @ X222 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(mem @ X227 @ X208)|((esk12_6 @ X208 @ X209 @ X210 @ X211 @ X222 @ X223)!=(ap @ X222 @ X227))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__GAP @ X208 @ X209) @ X222) @ X223))|~(mem @ X223 @ (arr @ X209 @ bool))|~(mem @ X222 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))))&((((mem @ (esk13_6 @ X208 @ X209 @ X210 @ X211 @ X228 @ X229) @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X228) @ X229))|~(mem @ X229 @ (arr @ X209 @ bool))|~(mem @ X228 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((p @ (ap @ X229 @ (ap @ X228 @ (esk13_6 @ X208 @ X209 @ X210 @ X211 @ X228 @ X229))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X228) @ X229))|~(mem @ X229 @ (arr @ X209 @ bool))|~(mem @ X228 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X208 @ X209) @ X228) @ X229))|(~(mem @ X231 @ X208)|~(p @ (ap @ X229 @ (ap @ X228 @ X231))))|~(mem @ X229 @ (arr @ X209 @ bool))|~(mem @ X228 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))&((~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X232) @ X233))|(~(mem @ X234 @ X208)|(p @ (ap @ X233 @ (ap @ X232 @ X234))))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(((mem @ (esk14_6 @ X208 @ X209 @ X210 @ X211 @ X232 @ X233) @ X208)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X232) @ X233))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X233 @ (ap @ X232 @ (esk14_6 @ X208 @ X209 @ X210 @ X211 @ X232 @ X233))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS__POINT @ X208 @ X209) @ X232) @ X233))|~(mem @ X233 @ (arr @ X209 @ bool))|~(mem @ X232 @ (arr @ X208 @ X209))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))))&((((mem @ (esk15_5 @ X208 @ X209 @ X210 @ X211 @ X236) @ X208)|(p @ (ap @ X210 @ X236))|~(mem @ X236 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(p @ (ap @ X210 @ (ap @ X211 @ (esk15_5 @ X208 @ X209 @ X210 @ X211 @ X236))))|(p @ (ap @ X210 @ X236))|~(mem @ X236 @ X209)|~(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209)))&(((mem @ (esk16_4 @ X208 @ X209 @ X210 @ X211) @ X209)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&((~(p @ (ap @ X210 @ (esk16_4 @ X208 @ X209 @ X210 @ X211)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))&(~(mem @ X239 @ X208)|(p @ (ap @ X210 @ (ap @ X211 @ X239)))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL @ X208 @ X209) @ X211) @ X210))|~(epred4_4 @ X211 @ X210 @ X208 @ X209))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])). 3.83/2.00 thf(c_0_13, negated_conjecture, ![X3:$i, X4:$i]:(((epred6_0)|~((mem @ X3 @ (arr @ esk1_0 @ bool)))|~((mem @ X4 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 3.83/2.00 thf(c_0_14, negated_conjecture, (mem @ esk5_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_15, plain, ![X1:del, X2:del, X3:$i]:(((mem @ X3 @ (arr @ X1 @ X2))=>![X4:$i]:(((mem @ X4 @ X1)=>(mem @ (ap @ X3 @ X4) @ X2))))), inference(fof_simplification,[status(thm)],[ap_tp])). 3.83/2.00 thf(c_0_16, plain, ![X1:del, X9:$i, X4:$i, X3:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ X3))|~((p @ (ap @ X3 @ (ap @ X4 @ X9))))|~((mem @ X9 @ X1))|~((epred4_4 @ X4 @ X3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_17, plain, ![X1:del, X4:$i, X10:$i, X9:$i, X3:$i, X2:del]:(((p @ (ap @ X3 @ (ap @ X4 @ (esk13_6 @ X1 @ X2 @ X9 @ X10 @ X4 @ X3))))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X4) @ X3))|~((mem @ X3 @ (arr @ X2 @ bool)))|~((mem @ X4 @ (arr @ X1 @ X2)))|~((epred4_4 @ X10 @ X9 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_18, plain, (~((epred5_0))<=>![X3:$i]:((~((mem @ X3 @ esk2_0))|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X3))))))), introduced(definition)). 3.83/2.00 thf(c_0_19, plain, ![X11:$i, X1:del, X4:$i, X3:$i, X10:$i, X9:$i, X2:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X3) @ X4)))|~((mem @ X9 @ X1))|~((p @ (ap @ X4 @ (ap @ X3 @ X9))))|~((mem @ X4 @ (arr @ X2 @ bool)))|~((mem @ X3 @ (arr @ X1 @ X2)))|~((epred4_4 @ X10 @ X11 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_20, negated_conjecture, (p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_21, negated_conjecture, (mem @ esk4_0 @ (arr @ esk1_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_22, negated_conjecture, (mem @ esk3_0 @ (arr @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_23, negated_conjecture, ![X3:$i]:(((epred6_0)|~((mem @ X3 @ (arr @ esk2_0 @ esk1_0))))), inference(spm,[status(thm)],[c_0_13, c_0_14])). 3.83/2.00 thf(c_0_24, plain, ![X171:del, X172:del, X173:$i, X174:$i]:((~(mem @ X173 @ (arr @ X171 @ X172))|(~(mem @ X174 @ X171)|(mem @ (ap @ X173 @ X174) @ X172)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])). 3.83/2.00 thf(c_0_25, plain, ![X1:del, X3:$i, X14:del, X13:del, X10:$i, X9:$i, X4:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X3) @ X4))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X13 @ X14) @ X3) @ X4))|~((mem @ (esk13_6 @ X1 @ X2 @ X9 @ X10 @ X3 @ X4) @ X13))|~((mem @ X4 @ (arr @ X2 @ bool)))|~((mem @ X3 @ (arr @ X1 @ X2)))|~((epred4_4 @ X3 @ X4 @ X13 @ X14))|~((epred4_4 @ X10 @ X9 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])). 3.83/2.00 thf(c_0_26, plain, ![X1:del, X10:$i, X9:$i, X4:$i, X3:$i, X2:del]:(((mem @ (esk13_6 @ X1 @ X2 @ X3 @ X4 @ X9 @ X10) @ X1)|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X9) @ X10))|~((mem @ X10 @ (arr @ X2 @ bool)))|~((mem @ X9 @ (arr @ X1 @ X2)))|~((epred4_4 @ X4 @ X3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_27, negated_conjecture, ![X3:$i]:(((p @ (ap @ esk4_0 @ X3))|~((mem @ X3 @ esk1_0))|~((p @ (ap @ esk5_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_28, plain, ![X1:del, X9:$i, X4:$i, X3:$i, X2:del]:(((p @ (ap @ X3 @ (ap @ X4 @ (esk8_5 @ X1 @ X2 @ X3 @ X4 @ X9))))|~((p @ (ap @ X3 @ X9)))|~((mem @ X9 @ X2))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ X3)))|~((epred4_4 @ X4 @ X3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_29, negated_conjecture, (~((epred6_0))|~((epred5_0))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21]), c_0_22])]), c_0_18]), c_0_5])). 3.83/2.00 thf(c_0_30, negated_conjecture, (epred6_0), inference(spm,[status(thm)],[c_0_23, c_0_22])). 3.83/2.00 thf(c_0_31, plain, ![X2:del, X4:$i, X3:$i, X1:del]:(((mem @ (ap @ X3 @ X4) @ X2)|~((mem @ X3 @ (arr @ X1 @ X2)))|~((mem @ X4 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_24])). 3.83/2.00 thf(c_0_32, plain, ![X4:$i, X3:$i, X2:del, X1:del, X10:$i, X9:$i, X13:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X3) @ X4))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X13) @ X3) @ X4))|~((mem @ X4 @ (arr @ X13 @ bool)))|~((mem @ X3 @ (arr @ X1 @ X13)))|~((epred4_4 @ X3 @ X4 @ X1 @ X2))|~((epred4_4 @ X9 @ X10 @ X1 @ X13)))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 3.83/2.00 thf(c_0_33, negated_conjecture, ![X3:$i]:(((epred5_0)|~((p @ (ap @ esk4_0 @ (ap @ esk3_0 @ X3))))|~((mem @ X3 @ esk2_0)))), inference(split_equiv,[status(thm)],[c_0_18])). 3.83/2.00 thf(c_0_34, negated_conjecture, ![X1:del, X4:$i, X3:$i, X2:del]:(((p @ (ap @ esk4_0 @ (ap @ X3 @ (esk8_5 @ X1 @ X2 @ esk5_0 @ X3 @ X4))))|~((mem @ (ap @ X3 @ (esk8_5 @ X1 @ X2 @ esk5_0 @ X3 @ X4)) @ esk1_0))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X3) @ esk5_0)))|~((p @ (ap @ esk5_0 @ X4)))|~((epred4_4 @ X3 @ esk5_0 @ X1 @ X2))|~((mem @ X4 @ X2)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 3.83/2.00 thf(c_0_35, negated_conjecture, ~((epred5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_30])])). 3.83/2.00 thf(c_0_36, negated_conjecture, ![X3:$i]:(((mem @ (ap @ esk3_0 @ X3) @ esk1_0)|~((mem @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_31, c_0_22])). 3.83/2.00 thf(c_0_37, plain, ![X2:del, X1:del, X4:$i, X10:$i, X9:$i, X3:$i, X13:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X3) @ X4))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X13) @ X3) @ X4))|~((mem @ X4 @ (arr @ X2 @ bool)))|~((mem @ X9 @ (arr @ X2 @ bool)))|~((mem @ X3 @ (arr @ X1 @ X2)))|~((mem @ X10 @ (arr @ X1 @ X2)))|~((epred4_4 @ X3 @ X4 @ X1 @ X13)))), inference(spm,[status(thm)],[c_0_32, c_0_10])). 3.83/2.00 thf(c_0_38, negated_conjecture, ![X1:del, X3:$i, X2:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ esk3_0) @ esk5_0)))|~((mem @ (esk8_5 @ X1 @ X2 @ esk5_0 @ esk3_0 @ X3) @ esk2_0))|~((epred4_4 @ esk3_0 @ esk5_0 @ X1 @ X2))|~((p @ (ap @ esk5_0 @ X3)))|~((mem @ X3 @ X2)))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), c_0_36])). 3.83/2.00 thf(c_0_39, plain, ![X1:del, X9:$i, X4:$i, X3:$i, X2:del]:(((mem @ (esk8_5 @ X1 @ X2 @ X3 @ X4 @ X9) @ X1)|~((p @ (ap @ X3 @ X9)))|~((mem @ X9 @ X2))|~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X4) @ X3)))|~((epred4_4 @ X4 @ X3 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 3.83/2.00 thf(c_0_40, negated_conjecture, ![X1:del, X9:$i, X4:$i, X3:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ esk1_0) @ X3) @ X4))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ X1 @ X2) @ X3) @ X4))|~((mem @ X4 @ (arr @ esk1_0 @ bool)))|~((mem @ X3 @ (arr @ X1 @ esk1_0)))|~((mem @ X9 @ (arr @ X1 @ esk1_0)))|~((epred4_4 @ X3 @ X4 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_37, c_0_14])). 3.83/2.00 thf(c_0_41, plain, ![X3:$i, X1:del]:((~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X1) @ esk3_0) @ esk5_0)))|~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X1))|~((p @ (ap @ esk5_0 @ X3)))|~((mem @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_38, c_0_39])). 3.83/2.00 thf(c_0_42, negated_conjecture, ![X4:$i, X3:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ X3) @ X4))|(p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__EXISTS @ esk2_0 @ X1) @ X3) @ X4))|~((mem @ X4 @ (arr @ esk1_0 @ bool)))|~((mem @ X3 @ (arr @ esk2_0 @ esk1_0)))|~((epred4_4 @ X3 @ X4 @ esk2_0 @ X1)))), inference(spm,[status(thm)],[c_0_40, c_0_22])). 3.83/2.00 thf(c_0_43, negated_conjecture, ~((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ esk1_0) @ esk3_0) @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_11])). 3.83/2.00 thf(c_0_44, plain, ![X3:$i, X1:del]:((~((epred4_4 @ esk3_0 @ esk5_0 @ esk2_0 @ X1))|~((p @ (ap @ esk5_0 @ X3)))|~((mem @ X3 @ X1)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_14]), c_0_22])]), c_0_43])). 3.83/2.00 thf(c_0_45, plain, ![X3:$i, X1:del]:((~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((p @ (ap @ esk5_0 @ X3)))|~((mem @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_44, c_0_10])). 3.83/2.00 thf(c_0_46, negated_conjecture, ![X3:$i]:((~((p @ (ap @ esk5_0 @ X3)))|~((mem @ X3 @ esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_22]), c_0_14])])). 3.83/2.00 thf(c_0_47, plain, ![X1:del, X9:$i, X4:$i, X3:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ X3) @ esk5_0))|~((mem @ (ap @ X3 @ (esk13_6 @ X1 @ X2 @ X4 @ X9 @ X3 @ esk5_0)) @ esk1_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ X3 @ (arr @ X1 @ X2)))|~((epred4_4 @ X9 @ X4 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_46, c_0_17])). 3.83/2.00 thf(c_0_48, negated_conjecture, ![X1:del, X4:$i, X3:$i, X2:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ X1 @ X2) @ esk3_0) @ esk5_0))|~((mem @ (esk13_6 @ X1 @ X2 @ X3 @ X4 @ esk3_0 @ esk5_0) @ esk2_0))|~((mem @ esk5_0 @ (arr @ X2 @ bool)))|~((mem @ esk3_0 @ (arr @ X1 @ X2)))|~((epred4_4 @ X4 @ X3 @ X1 @ X2)))), inference(spm,[status(thm)],[c_0_47, c_0_36])). 3.83/2.00 thf(c_0_49, plain, ![X4:$i, X3:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X1) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((epred4_4 @ X3 @ X4 @ esk2_0 @ X1)))), inference(spm,[status(thm)],[c_0_48, c_0_26])). 3.83/2.00 thf(c_0_50, plain, ![X4:$i, X3:$i, X1:del]:(((p @ (ap @ (ap @ (c_2EquantHeuristics_2EGUESS__FORALL__POINT @ esk2_0 @ X1) @ esk3_0) @ esk5_0))|~((mem @ esk5_0 @ (arr @ X1 @ bool)))|~((mem @ esk3_0 @ (arr @ esk2_0 @ X1)))|~((mem @ X3 @ (arr @ X1 @ bool)))|~((mem @ X4 @ (arr @ esk2_0 @ X1))))), inference(spm,[status(thm)],[c_0_49, c_0_10])). 3.83/2.00 thf(c_0_51, negated_conjecture, ![X3:$i]:(~((mem @ X3 @ (arr @ esk2_0 @ esk1_0)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_14]), c_0_14]), c_0_22])]), c_0_43])). 3.83/2.00 thf(c_0_52, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_22, c_0_51]), ['proof']). 3.83/2.00 # SZS output end CNFRefutation 3.83/2.00 # Parsed axioms : 75 3.83/2.00 # Removed by relevancy pruning/SinE : 48 3.83/2.00 # Initial clauses : 278 3.83/2.00 # Removed in clause preprocessing : 209 3.83/2.00 # Initial clauses in saturation : 69 3.83/2.00 # Processed clauses : 511 3.83/2.00 # ...of these trivial : 0 3.83/2.00 # ...subsumed : 101 3.83/2.00 # ...remaining for further processing : 410 3.83/2.00 # Other redundant clauses eliminated : 0 3.83/2.00 # Clauses deleted for lack of memory : 0 3.83/2.00 # Backward-subsumed : 12 3.83/2.00 # Backward-rewritten : 3 3.83/2.00 # Generated clauses : 4046 3.83/2.00 # ...of the previous two non-redundant : 3979 3.83/2.00 # ...aggressively subsumed : 0 3.83/2.00 # Contextual simplify-reflections : 1 3.83/2.00 # Paramodulations : 4041 3.83/2.00 # Factorizations : 0 3.83/2.00 # NegExts : 0 3.83/2.00 # Equation resolutions : 1 3.83/2.00 # Disequality decompositions : 0 3.83/2.00 # Total rewrite steps : 182 3.83/2.00 # ...of those cached : 177 3.83/2.00 # Propositional unsat checks : 0 3.83/2.00 # Propositional check models : 0 3.83/2.00 # Propositional check unsatisfiable : 0 3.83/2.00 # Propositional clauses : 0 3.83/2.00 # Propositional clauses after purity: 0 3.83/2.00 # Propositional unsat core size : 0 3.83/2.00 # Propositional preprocessing time : 0.000 3.83/2.00 # Propositional encoding time : 0.000 3.83/2.00 # Propositional solver time : 0.000 3.83/2.00 # Success case prop preproc time : 0.000 3.83/2.00 # Success case prop encoding time : 0.000 3.83/2.00 # Success case prop solver time : 0.000 3.83/2.00 # Current number of processed clauses : 393 3.83/2.00 # Positive orientable unit clauses : 10 3.83/2.00 # Positive unorientable unit clauses: 0 3.83/2.00 # Negative unit clauses : 3 3.83/2.00 # Non-unit-clauses : 380 3.83/2.00 # Current number of unprocessed clauses: 3516 3.83/2.00 # ...number of literals in the above : 30730 3.83/2.00 # Current number of archived formulas : 0 3.83/2.00 # Current number of archived clauses : 16 3.83/2.00 # Clause-clause subsumption calls (NU) : 24579 3.83/2.00 # Rec. Clause-clause subsumption calls : 3741 3.83/2.00 # Non-unit clause-clause subsumptions : 111 3.83/2.00 # Unit Clause-clause subsumption calls : 390 3.83/2.00 # Rewrite failures with RHS unbound : 0 3.83/2.00 # BW rewrite match attempts : 1 3.83/2.00 # BW rewrite match successes : 1 3.83/2.00 # Condensation attempts : 0 3.83/2.00 # Condensation successes : 0 3.83/2.00 # Termbank termtop insertions : 190919 3.83/2.00 # Search garbage collected termcells : 4738 3.83/2.00 3.83/2.00 # ------------------------------------------------- 3.83/2.00 # User time : 0.255 s 3.83/2.00 # System time : 0.013 s 3.83/2.00 # Total time : 0.267 s 3.83/2.00 # Maximum resident set size: 2808 pages 3.83/2.00 3.83/2.00 # ------------------------------------------------- 3.83/2.00 # User time : 0.257 s 3.83/2.00 # System time : 0.016 s 3.83/2.00 # Total time : 0.273 s 3.83/2.00 # Maximum resident set size: 1840 pages 3.83/2.00 % E---3.1 exiting 3.83/2.00 % E exiting 3.83/2.00 EOF